Bilevel Programming, Equilibrium, and Combinatorial Problems with Applications to Engineering

Bilevel Programming: a Combinatorial Perspective

Less than 100 words

Combinatorial Optimization Problems in Engineering Applications

This paper deals with several combinatorial optimization problems. The most challenging such problem is the quadratic assignment problem. It is considered in both two dimensions (QAP) and in three dimensions (Q3AP) and in the context of communication engineering. Semidefinite relaxations are used to derive lower bounds for the optimum while heuristics are applied to either find upper bounds or ...

Chapter 1 BILEVEL PROGRAMMING : A COMBINATORIAL PERSPECTIVE

Bilevel programming is a branch of optimization where a subset of variables is constrained to lie in the optimal set of an auxiliary mathematical program. This chapter presents an overview of two specific classes of bilevel programs, and in particular their relationship to well-known combinatorial problems.

Variational Analysis of Marginal Functions with Applications to Bilevel Programming

This paper pursues a twofold goal. First to derive new results on generalized differentiation in variational analysis focusing mainly on a broad class of intrinsically nondifferentiable marginal/value functions. Then the results established in this direction apply to deriving necessary optimality conditions for the optimistic version of bilevel programs that occupy a remarkable place in optimiz...

Bilevel Programming and Price Setting Problems